Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains
نویسندگان
چکیده
In this paper we consider the computational complexity of solving initial-value problems defined with analytic ordinary differential equations (ODEs) over unbounded domains of R and C, under the Computable Analysis setting. We show that the solution can be computed in polynomial time over its maximal interval of definition, provided it satisfies a very generous bound on its growth, and that the function admits an analytic extension to the complex plane.
منابع مشابه
Solving high-order partial differential equations in unbounded domains by means of double exponential second kind Chebyshev approximation
In this paper, a collocation method for solving high-order linear partial differential equations (PDEs) with variable coefficients under more general form of conditions is presented. This method is based on the approximation of the truncated double exponential second kind Chebyshev (ESC) series. The definition of the partial derivative is presented and derived as new operational matrices of der...
متن کاملComputational complexity of solving polynomial differential equations over unbounded domains with non-rational coefficients
In this note, we extend the result of [PG16] about the complexity of solving polynomial differential equations over unbounded domains to work with non-rational input. In order to deal with arbitrary input, we phrase the result in framework of Conputable Analysis [Ko91]. As a side result, we also get a uniform result about complexity of the operator, and not just about the solution. The complexi...
متن کاملComputational complexity of solving polynomial differential equations over unbounded domains
In this paper we investigate the computational complexity of solving ordinary differential equations (ODEs) y′ = p(y) over unbounded time domains, where p is a vector of polynomials. Contrarily to the bounded (compact) time case, this problem has not been well-studied, apparently due to the “intuition” that it can always be reduced to the bounded case by using rescaling techniques. However, as ...
متن کاملSOLVING SINGULAR ODES IN UNBOUNDED DOMAINS WITH SINC-COLLOCATION METHOD
Spectral approximations for ODEs in unbounded domains have only received limited attention. In many applicable problems, singular initial value problems arise. In solving these problems, most of numerical methods have difficulties and often could not pass the singular point successfully. In this paper, we apply the sinc-collocation method for solving singular initial value problems. The ability...
متن کاملNon-polynomial Spline Method for Solving Coupled Burgers Equations
In this paper, non-polynomial spline method for solving Coupled Burgers Equations are presented. We take a new spline function. The stability analysis using Von-Neumann technique shows the scheme is unconditionally stable. To test accuracy the error norms 2L, L are computed and give two examples to illustrate the sufficiency of the method for solving such nonlinear partial differential equation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011